Two theorems in stability theory

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preservation theorems in {L}ukasiewicz \model theory

We present some model theoretic results for {L}ukasiewiczpredicate logic by using the methods of continuous model theorydeveloped by Chang and Keisler.We prove compactness theorem with respect to the class of allstructures taking values in the {L}ukasiewicz $texttt{BL}$-algebra.We also prove some appropriate preservation theorems concerning universal and inductive theories.Finally, Skolemizatio...

متن کامل

Spectral Mapping Theorems and Stability Theory in Linear Dynamical Systems

The spectral properties of the operators inducing linear dynamical systems on Banach spaces determine the asymptotic properties of the systems. In this note an interaction between the spectral mapping properties of operators and stability properties of the corresponding dynamical systems is presented.

متن کامل

preservation theorems in {l}ukasiewicz model theory

we present some model theoretic results for {l}ukasiewiczpredicate logic by using the methods of continuous model theorydeveloped by chang and keisler.we prove compactness theorem with respect to the class of allstructures taking values in the {l}ukasiewicz $texttt{bl}$-algebra.we also prove some appropriate preservation theorems concerning universal and inductive theories.finally, skolemizatio...

متن کامل

Negative Theorems in Approximation Theory

1. INTRODUCTION. Negative theorems have a rich tradition in mathematics. In fact mathematics seems to be unique among the sciences in that negative results are very much a part of the mathematical edifice. Most mathematical theories try to explain what is possible and also what is not. To understand the structure of a mathematical theory is also to understand its limitations. There are many dif...

متن کامل

Stability theorems for cancellative hypergraphs

A cancellative hypergraph has no three edges A;B;C with ADBCC: We give a new short proof of an old result of Bollobás, which states that the maximum size of a cancellative triple system is achieved by the balanced complete tripartite 3-graph. One of the two forbidden subhypergraphs in a cancellative 3-graph is F5 1⁄4 fabc; abd; cdeg: For nX33 we show that the maximum number of triples on n vert...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1966

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1966-0192138-1